Micron Document
`:top
A `!tree structure`!, `!tree diagram`!, or `!tree model`! is a way of representing the `F33f`_`[hierarchical`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Hierarchy]`_`f nature of a `F33f`_`[structure`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Structure]`_`f in a graphical form. It is named a "tree structure" because the classic `F33f`_`[representation`#representing-trees]`_`f resembles a `F33f`_`[tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree]`_`f, although the chart is generally upside down compared to a biological tree, with the "stem" at the top and the "leaves" at the bottom.

A tree structure is conceptual, and appears in several forms. For a discussion of tree structures in specific fields, see `F33f`_`[Tree (data structure)`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(data_structure)]`_`f for computer science; insofar as it relates to graph theory, see `F33f`_`[tree (graph theory)`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(graph_theory)]`_`f or `F33f`_`[tree (set theory)`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(set_theory)]`_`f. Other related articles are listed below.

>>Contents

• `F0af`_`[Terminology and properties`#terminology-and-properties]`_`f
• `F0af`_`[Examples of tree structures`#examples-of-tree-structures]`_`f
• `F0af`_`[Representing trees`#representing-trees]`_`f
• `F0af`_`[Classical node-link diagrams`#classical-node-link-diagrams]`_`f
• `F0af`_`[Nested sets`#nested-sets]`_`f
• `F0af`_`[Layered "icicle" diagrams`#layered-icicle-diagrams]`_`f
• `F0af`_`[Outlines and tree views`#outlines-and-tree-views]`_`f
• `F0af`_`[Nested parentheses`#nested-parentheses]`_`f
• `F0af`_`[Radial trees`#radial-trees]`_`f
• `F0af`_`[See also`#see-also]`_`f
• `F0af`_`[References`#references]`_`f
• `F0af`_`[Further reading`#further-reading]`_`f
• `F0af`_`[External links`#external-links]`_`f

-─

>>Terminology and properties

The tree elements are called "`F33f`_`[nodes`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Node_(computer_science)]`_`f". The lines connecting elements are called "branches". Nodes without children are called `F33f`_`[leaf nodes`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Leaf_node]`_`f, "end-nodes", or "leaves".

Every `F33f`_`[finite`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Finite_set]`_`f tree structure has a member that has no `F33f`_`[superior`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Superior_(hierarchy)]`_`f. This member is called the "root" or `F33f`_`[root node`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Root_node]`_`f. The root is the starting node. But the converse is not true: infinite tree structures may or may not have a root node.

The names of relationships between nodes model the `F33f`_`[kinship terminology`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Kinship_terminology]`_`f of family relations. The gender-neutral names "parent" and "child" have largely displaced the older "father" and "son" terminology. The term "uncle" is still widely used for other nodes at the same level as the parent, although it is sometimes replaced with gender-neutral terms like "ommer".`:cite-ref-1[`F5bf`_`[1`#cite-note-1]`_`f]

• A node's "parent" is a node one step higher in the hierarchy (i.e. closer to the root node) and lying on the same branch.
• "Sibling" ("brother" or "sister") nodes share the same parent node.
• A node's "uncles" (sometimes "ommers") are siblings of that node's parent.
• A node that is connected to all lower-level nodes is called an "ancestor". The connected lower-level nodes are "descendants" of the ancestor node.

In the example, "encyclopedia" is the parent of "science" and "culture", its children. "Art" and "craft" are siblings, and children of "culture", which is their parent and thus one of their ancestors. Also, "encyclopedia", as the root of the tree, is the ancestor of "science", "culture", "art" and "craft". Finally, "science", "art" and "craft", as leaves, are ancestors of no other node.

Tree structures can depict all kinds of `F33f`_`[taxonomic`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Taxonomy_(general)]`_`f knowledge, such as `F33f`_`[family trees`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Family_tree]`_`f, the biological `F33f`_`[evolutionary tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Evolutionary_tree]`_`f, the `F33f`_`[evolutionary tree of a language family`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Indo-European_languages]`_`f, the `F33f`_`[grammatical structure`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Generative_grammar]`_`f of a language (a key example being S → NP VP, meaning a sentence is a noun phrase and a verb phrase, with each in turn having other components which have other components), the way web pages are logically ordered in a web site, `F33f`_`[mathematical trees of integer sets`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_of_primitive_Pythagorean_triples]`_`f, et cetera.

The `F33f`_`[Oxford English Dictionary`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Oxford_English_Dictionary]`_`f records use of both the terms "tree structure" and "tree-diagram" from 1965 in `F33f`_`[Noam Chomsky`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Noam_Chomsky]`_`f's `*`F33f`_`[Aspects of the Theory of Syntax`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Aspects_of_the_Theory_of_Syntax]`_`f`*.`:cite-ref-2[`F5bf`_`[2`#cite-note-2]`_`f]

In a tree structure there is one and only one `F33f`_`[path`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Path_(graph_theory)]`_`f from any point to any other point.

`F33f`_`[Computer science`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Computer_science]`_`f uses tree structures extensively (`*see`* `F33f`_`[Tree (data structure)`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(data_structure)]`_`f and `F33f`_`[telecommunications`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Telecommunications]`_`f.)

For a formal definition see `F33f`_`[set theory`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(set_theory)]`_`f, and for a generalization in which children are not necessarily successors, see `F33f`_`[prefix order`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Prefix_order]`_`f.

>>Examples of tree structures

• Internet:

• `F33f`_`[usenet hierarchy`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Usenet_hierarchy]`_`f
• `F33f`_`[Document Object Model`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Document_Object_Model]`_`f's logical structure,`:cite-ref-3[`F5bf`_`[3`#cite-note-3]`_`f] `F33f`_`[Yahoo!`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Yahoo!]`_`f subject index, `F33f`_`[Curlie`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Curlie]`_`f

• `F33f`_`[Operating system`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Operating_system]`_`f: `F33f`_`[directory structure`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Directory_structure]`_`f
• Information management: `F33f`_`[Dewey Decimal System`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Dewey_Decimal_Classification]`_`f, `F33f`_`[PSH`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Polythematic_Structured_Subject_Heading_System]`_`f, this hierarchical bulleted list
• Management: hierarchical `F33f`_`[organizational`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Organization]`_`f structures
• Computer science:

• `F33f`_`[binary search tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Binary_search_tree]`_`f
• `F33f`_`[red–black tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Red–black_tree]`_`f
• `F33f`_`[AVL tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=AVL_tree]`_`f
• `F33f`_`[R-tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=R-tree]`_`f
• `F33f`_`[doubly logarithmic tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Doubly_logarithmic_tree]`_`f

• Biology: `F33f`_`[evolutionary tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Evolutionary_tree]`_`f
• Business: `F33f`_`[pyramid selling scheme`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Pyramid_selling_scheme]`_`f
• Project management: `F33f`_`[work breakdown structure`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Work_breakdown_structure]`_`f
• Linguistics:

• (Syntax) `F33f`_`[Phrase structure trees`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Phrase_structure_rules]`_`f
• (Historical Linguistics) `F33f`_`[Tree model`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_model]`_`f of language change

• Sports: `F33f`_`[business chess`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Business_chess]`_`f, `F33f`_`[playoffs brackets`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Bracket_(tournament)]`_`f
• Mathematics: `F33f`_`[Von Neumann universe`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Von_Neumann_universe]`_`f
• Group theory: `F33f`_`[descendant trees`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Descendant_tree_(group_theory)]`_`f

>>Representing trees

There are many ways of visually representing tree structures. Almost always, these boil down to variations, or combinations, of a few basic styles:

>>>Classical node-link diagrams

Classical node-link diagrams, that connect nodes together with line segments:

>>>Nested sets

`F33f`_`[Nested sets`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Nested_set_collection]`_`f that use enclosure or containment to show parenthood; examples include `F33f`_`[TreeMaps`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Treemapping]`_`f, fractal maps, and `F33f`_`[Euler diagrams`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Euler_diagram]`_`f:

>>>Layered "icicle" diagrams

Layered "icicle" diagrams that use alignment/adjacency.

>>>Outlines and tree views

Lists or diagrams that use indentation, sometimes called "`F33f`_`[outlines`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Outline_(hierarchical)]`_`f" or "`F33f`_`[tree views`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_view]`_`f".

An outline:

`!encyclopedia`! `!culture`! `!art`! `!craft`! `!science`!

A tree view:

• `!encyclopedia`!

• `!culture`!

• `!art`!
• `!craft`!

• `!science`!

>>>Nested parentheses

A correspondence to nested parentheses was first noticed by Sir `F33f`_`[Arthur Cayley`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Arthur_Cayley]`_`f:

`!((art,craft)culture,science)encyclopedia`!
or
`!encyclopedia(culture(art,craft),science)`!

>>>Radial trees

Trees can also be `F33f`_`[represented radially`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Radial_tree]`_`f:

>>See also

`!Kinds of trees`!

• `F33f`_`[B-tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=B-tree]`_`f
• `F33f`_`[Dancing tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Dancing_tree]`_`f
• `F33f`_`[Decision tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Decision_tree]`_`f
• `F33f`_`[Left-child right-sibling binary tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Left-child_right-sibling_binary_tree]`_`f
• `F33f`_`[Porphyrian tree`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Porphyrian_tree]`_`f
• `F33f`_`[Tree (data structure)`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(data_structure)]`_`f
• `F33f`_`[Tree (graph theory)`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(graph_theory)]`_`f
• `F33f`_`[Tree (set theory)`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_(set_theory)]`_`f

`!Related articles`!

• `F33f`_`[Data drilling`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Data_drilling]`_`f
• `F33f`_`[Hierarchical model`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Hierarchical_model]`_`f: `F33f`_`[clustering`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Hierarchical_clustering]`_`f and `F33f`_`[query`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Hierarchical_query]`_`f
• `F33f`_`[Tree testing`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Tree_testing]`_`f

>>References

`:cite-note-1`!1.`! `F0af`_`[↑`#cite-ref-1]`_`f "Ethereum Glossary". `*GitHub`*. Archived from the original on 25 April 2019. Retrieved 17 April 2019.
`:cite-note-2`!2.`! `F0af`_`[↑`#cite-ref-2]`_`f `:citerefreference-oed-tree`a"tree". `*`F33f`_`[Oxford English Dictionary`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Oxford_English_Dictionary]`_`f`* (Online ed.). `F33f`_`[Oxford University Press`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Oxford_University_Press]`_`f. (Subscription or participating institution membership required.)
`:cite-note-3`!3.`! `F0af`_`[↑`#cite-ref-3]`_`f "What is the Document Object Model?". `*W3C Architecture domain`*. Archived from the original on 2012-02-12. Retrieved 2006-12-05.

>>Further reading

Identification of some of the basic styles of tree structures can be found in:

• `F33f`_`[Jacques Bertin`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Jacques_Bertin]`_`f, `*Semiology of Graphics`*, 1983, University of Wisconsin Press (2nd edition 1973, `F33f`_`[ISBN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISBN_(identifier)]`_`f 978-0299090609;
• `:citerefdonald-e-knuth1968`a`F33f`_`[Donald E. Knuth`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Donald_E._Knuth]`_`f (1968). `*`F33f`_`[The Art of Computer Programming`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=The_Art_of_Computer_Programming]`_`f`*. Volume 1: Fundamental Algorithms. Addison-Wesley. pp. 309–310.
• Brian Johnson and `F33f`_`[Ben Shneiderman`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Ben_Shneiderman]`_`f, "Tree-maps: A space-filling approach to the visualization of hierarchical information structures", in `*Proceedings of IEEE Visualization (VIS)`*, 1991, pp. 284–291, `F33f`_`[ISBN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISBN_(identifier)]`_`f 0-8186-2245-8;
• `F33f`_`[Peter Eades`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Peter_Eades]`_`f, Tao Lin, and Xuemin Lin, "Two Tree Drawing Conventions", `*International Journal of Computational Geometry and Applications`*, 1993, volume 3, number 2, pp. 133–153.
• `:citerefmanuel-lima2014`a`F33f`_`[Manuel Lima`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Manuel_Lima]`_`f (2014). `*The Book of Trees: Visualizing Branches of Knowledge`* (1st ed.). New York: Princeton Architectural Press. `F33f`_`[ISBN`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=ISBN_(identifier)]`_`f 978-1-616-89218-0.

>>External links

Wikimedia Commons has media related to

Tree diagram

.

• Visualization of phylogenetic trees on the T-REX server
• Using a tree structure to design a business process – from the `F33f`_`[Society for Technical Communication`:/page/wikibook/entry.mu`zim=wikipedia_en_all_nopic_2025-08.zim|entry_path=Society_for_Technical_Communication]`_`f

`c`F0af`_`[↑ Back to top`#top]`_`f`a